Discovery of Dependency Tree Patterns for Relation Extraction
نویسندگان
چکیده
Relation extraction is to identify the relations between pairs of named entities. In this paper, we try to solve the problem of relation extraction by discovering dependency tree patterns (a pattern is an embedded sub dependency tree indicating a relation instance). Our approach is to find an optimal rule (pattern) set automatically based on the proposed dependency tree pattern mining algorithm. The experimental results show that the extracted patterns can achieve a high precision and a reasonable recall rate when used as rules to extract relation instances. Furthermore, an additional experiment shows that other machine learning based relation extraction methods can also benefit from the extracted patterns by using them as features.
منابع مشابه
TEG-REP: A corpus of Textual Entailment Graphs based on Relation Extraction Patterns
The task of relation extraction is to recognize and extract relations between entities or concepts in texts. Dependency parse trees have become a popular source for discovering extraction patterns, which encode the grammatical relations among the phrases that jointly express relation instances. State-of-the-art weakly supervised approaches to relation extraction typically extract thousands of u...
متن کاملAn Improved Extraction Pattern Representation Model for Automatic IE Pattern Acquisition
Several approaches have been described for the automatic unsupervised acquisition of patterns for information extraction. Each approach is based on a particular model for the patterns to be acquired, such as a predicate-argument structure or a dependency chain. The effect of these alternative models has not been previously studied. In this paper, we compare the prior models and introduce a new ...
متن کاملSemantic Relation Extraction Using Penalty Tree Similarity
In the past decades, kernel methods are enthusiastically explored for relation extraction. This paper proposes a penalty tree similarity algorithm by extending the dependency tree kernel. Dependency tree kernel computes the similarity of two parse trees by enumerating their matched sub-trees. The penalty tree similarity, however, not only consider the similar structures of the parse trees, but ...
متن کاملUnsupervised Discovery of Relations and Discriminative Extraction Patterns
Unsupervised Relation Extraction (URE) is the task of extracting relations of a priori unknown semantic types using clustering methods on a vector space model of entity pairs and patterns. In this paper, we show that an informed feature generation technique based on dependency trees significantly improves clustering quality, as measured by the F-score, and therefore the ability of the URE metho...
متن کاملComposite Kernels For Relation Extraction
The automatic extraction of relations between entities expressed in natural language text is an important problem for IR and text understanding. In this paper we show how different kernels for parse trees can be combined to improve the relation extraction quality. On a public benchmark dataset the combination of a kernel for phrase grammar parse trees and for dependency parse trees outperforms ...
متن کامل